2-Log-Concavity of the Boros–Moll Polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unimodality and Log-Concavity of Polynomials

A polynomial is unimodal if its sequence of coefficients are increasing up to an index, and then are decreasing after that index. A polynomial is logconcave if the sequence of the logarithms of the coefficients is concave. We prove that if P (x) is a polynomial with nonnegative non-decreasing coefficients then P (x+z) is unimodal for any natural z. Furthermore, we prove that if P (x) is a log-c...

متن کامل

Expansions of Chromatic Polynomials and Log-concavity

In this paper we present several results and open problems about logconcavity properties of sequences associated with graph colorings. Five polynomials intimately related to the chromatic polynomial of a graph are introduced and their zeros, combinatorial and log-concavity properties are studied. Four of these polynomials have never been considered before in the literature and some yield new ex...

متن کامل

Log-concavity of the genus polynomials of Ringel Ladders

A Ringel ladder can be formed by a self-bar-amalgamation operation on a symmetric ladder, that is, by joining the root vertices on its end-rungs. The present authors have previously derived criteria under which linear chains of copies of one or more graphs have log-concave genus polynomials. Herein we establish Ringel ladders as the first significant non-linear infinite family of graphs known t...

متن کامل

The Reverse Ultra Log-Concavity of the Boros-Moll Polynomials

Based on the recurrence relations on the coefficients of the Boros-Moll polynomials Pm(a) = ∑ i di(m)a i derived independently by Kauers and Paule, and Moll, we are led to the discovery of the reverse ultra log-concavity of the sequence {di(m)}. We also show that the sequence {i!di(m)} is log-concave for m ≥ 1. Two conjectures are proposed.

متن کامل

On the log-concavity of Laplacian characteristic polynomials of graphs

Let G be a graph and L(G) be the Laplacian matrix of G. In this article, we first point out that the sequence of the moduli of Laplacian coefficients of G is log-concave and hence unimodal. Using this fact, we provide an upper bound for the partial sums of the Laplacian eigenvalues of G, based on coefficients of its Laplacian characteristic polynomial. We then obtain some lower bounds on the al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 2013

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091513000412